An Achievable Rate Region for Cooperative Multiple Access Channel

نویسنده

  • Jingxian Wu
چکیده

An achievable rate region for a 3-node cooperative multiple access channel (CMAC) is presented in this paper. A CMAC contains multiple users cooperatively transmitting information to a single destination node. It includes the traditional multiple access channel that assumes no communication between source nodes, and multiple input single output (MISO) system that contains ideal links between source nodes, as special cases. The achievable rate regions for both general CMAC and degraded Gaussian CMAC are derived with the assistance of a block Markov encoding scheme. The impacts of cooperation strategies between source nodes on node transmission rates are investigated by modeling node cooperation as a strategic game, and the Nash equilibrium of cooperation strategy for degraded Gaussian CMAC is identified.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the Achievable Rate-Regions for the Gaussian Two-way Diamond Channels

In this channel,we study rate region of a Gaussian two-way diamond channel which operates in half-duplex mode. In this channel, two transceiver (TR) nodes exchange their messages with the help of two relay nodes. We consider a special case of the Gaussian two-way diamond channels which is called Compute-and-Forward Multiple Access Channel (CF-MAC). In the CF-MAC, the TR nodes transmit their mes...

متن کامل

Power and Channel Resource Allocation in Cooperative Multiple Access Schemes Power and Channel Resource Allocation in Cooperative Multiple Access Schemes

In this thesis, we develop efficient algorithms for the jointly optimal power and chan­ nel resource allocation in different wireless cooperative multiple access systems. In addition, in some cases insight into the structure of the optimal allocation enables the development of modified cooperation schemes with better performance, and efficient algorithms are developed for jointly optimal power ...

متن کامل

Achievable Secrecy Rate Regions of State Dependent Causal Cognitive Interference Channel

In this paper, the secrecy problem in the state dependent causal cognitive interference channel is studied. The channel state is non-causally known at the cognitive encoder. The message of the cognitive encoder must be kept secret from the primary receiver. We use a coding scheme which is a combination of compress-and-forward strategy with Marton coding, Gel’fand-Pinsker coding and Wyner’s wire...

متن کامل

An achievable rate region for the multiple-access channel with feedback

An achievable rate region R , G I( X, ; Y 1 X,, U), R 2 G 1(X2; YIX,, U), RI + R2 G 4x1, X2; Y), where P(U, xl, XZ, Y) = p(u)p(x,~u)p(x~~u)p(ylxl,x~), is established for the multiple-access channel with feedback. Time sharing of these achievable rates yields the rate region of this paper. This region generally exceeds the achievable rate region without feedback and exceeds the rate point found ...

متن کامل

Extension of the Coverage Region of Multiple Access Channels by Using a Relay

From practical and theoretical viewpoints, performance analysis of communication systems by using information-theoretic results is important. In this paper, based on our previous work on Multiple Access Channel (MAC) and Multiple Access Relay Channel (MARC), we analyze the impact of a relay on the fundamental wireless communications concept, i.e., coverage region of MARC, as a basic model for u...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009